package demo2;

import javax.swing.tree.TreeNode;

/**
 * Created with IntelliJ IDEA.
 * Description:二叉树的最近公共祖先方法一
 * User: liangyuanzhang
 * Date: 2025-4-27
 * Time: 1:05
 */
public class Test {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if (root == null) {
            return null;
        }
        if (root == p || root == q) {
            return root;
        }
        TreeNode leftTree = lowestCommonAncestor(root.left, p, q);
        TreeNode rightTree = lowestCommonAncestor(root.right, p, q);

        if (leftTree != null && rightTree != null) {
            return root;
        } else if (leftTree != null) {
            return leftTree;
        } else {
            return rightTree;
        }
    }
}
